Center and periphery
نویسندگان
چکیده
منابع مشابه
The Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملthe center and periphery of composite graphs
the center (periphery) of a graph is the set of vertices with minimum (maximum)eccentricity. in this paper, the structure of centers and peripheries of some classes ofcomposite graphs are determined. the relations between eccentricity, radius and diameterof such composite graphs are also investigated. as an application we determinethe center and periphery of some chemical graphs such as nanotor...
متن کاملCyclical growth and center - periphery interaction
Prebisch believed that understanding the evolution of capitalist economies over time and in different contexts required a general cycle approach, which he labeled ‘dynamic economics’, encompassing all the different areas of economic activity. His dynamic economics developed between 1945 and 1949 stemmed from a critique of both Neoclassical and Keynesian theories which Prebisch viewed as static ...
متن کاملThe Coarse Structure of the Center Periphery
Spanish displays a set of diverse contexts in which constituents are frozen inside the VP: only direct objects and postverbal subjects but not preverbal subjects or IP material are licensed. These environments include: indefinites licensed by modals, syntactically-marked focus (as opposed to stress-focus), evidentials, etc. It is argued that all of these contexts involve a projection exactly ab...
متن کاملClosed 3-stop Center and Periphery in Graphs
A delivery person must leave the central location of the business, deliver packages at a number of addresses, and then return. Naturally, he/she wishes to reduce costs by finding the most efficient route. This motivates the following: Given a set of k distinct vertices S = {x1, x2, . . . , xk} in a simple graph G, the closed k-stop-distance of set S is defined to be dk(S) = min θ∈P(S) (d(θ(x1),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LAPLAGE EM REVISTA
سال: 2021
ISSN: 2446-6220
DOI: 10.24115/s2446-6220202171776p.429-448